Paraconsistent Reasoning via Quantified Boolean Formulas, II: Circumscribing Inconsistent Theories
نویسندگان
چکیده
Through minimal-model semantics, three-valued logics provide an interesting formalism for capturing reasoning from inconsistent information. However, the resulting paraconsistent logics lack so far a uniform implementation platform. Here, we address this and specifically provide a translation of two such paraconsistent logics into the language of quantified Boolean formulas (QBFs). These formulas can then be evaluated by off-the-shelf QBF solvers. In this way, we benefit from the following advantages: First, our approach allows us to harness the performance of existing QBF solvers. Second, different paraconsistent logics can be compared with in a unified setting via the translations used. We alternatively provide a translation of these two paraconsistent logics into quantified Boolean formulas representing circumscription, the well-known system for logical minimization. All this forms a case study inasmuch as the other existing minimization-based many-valued paraconsistent logics can be dealt with in a similar fashion.
منابع مشابه
Models and Sets Dynamics, Interaction and Nonmonotonicity Paraconsistent Reasoning via Quantified Boolean Formulas, I: Axiomatising Signed Systems
Signed systems were introduced as a general, syntaxindependent framework for paraconsistent reasoning, that is, nontrivialised reasoning from inconsistent information. In this paper, we show how the family of corresponding paraconsistent consequence relations can be axiomatised by means of quantified Boolean formulas. This approach has several benefits. First, it furnishes an axiomatic specific...
متن کاملParaconsistent Reasoning via Quantified Boolean Formulas, I: Axiomatising Signed Systems
Signed systems were introduced as a general, syntax-independent framework for paraconsistent reasoning, that is, non-trivialised reasoning from inconsistent information. In this paper, we show how the family of corresponding paraconsistent consequence relations can be axiomatised by means of quantified Boolean formulas. This approach has several benefits. First, it furnishes an axiomatic specif...
متن کاملRepresenting Paraconsistent Reasoning via Quantified Propositional Logic
Quantified propositional logic is an extension of classical propositional logic where quantifications over atomic formulas are permitted. As such, quantified propositional logic is a fragment of secondorder logic, and its sentences are usually referred to as quantified Boolean formulas (QBFs). The motivation to study quantified propositional logic for paraconsistent reasoning is based on two fu...
متن کاملParaconsistent Preferential Reasoning by Signed Quantified Boolean Formulae
We introduce a uniform approach of representing a variety of paraconsistent non-monotonic formalisms by quantified Boolean formulae (QBFs) in the context of four-valued semantics. This framework provides a useful platform for capturing, in a simple and natural way, a wide range of methods for preferential reasoning. Off-the-shelf QBF solvers may therefore be incorporated for simulating the corr...
متن کاملParaconsistent Hybrid Theories
We consider the problem of reasoning from inconsistent hybrid theories, i.e., combinations of a structural part given by a classical first order theory (e.g., an ontology) and a rules part as a set of declarative logic program rules (under answerset semantics). Paraconsistent reasoning is achieved by defining an appropriate semantics, so-called paraconsistent semiequilibrium model semantics for...
متن کامل